An Algorithm for Partitions
نویسندگان
چکیده
منابع مشابه
An efficient algorithm for computing the distance between close partitions
A K− partition of a set S is a splitting of S into K non-overlapping classes that cover all elements of S. Numerous practical applications dealing with data partitioning or clustering require computing the distance between two partitions. Previous articles proved that one can compute it in polynomial time—minimum O(|S| + K2) and maximum O(|S| + K3)—using a reduction to the linear assignment pro...
متن کاملAn Approximation Algorithm for Complete Partitions of Regular Graphs
A complete partition of a graph is a partition of the vertex set such that any two classes are connected by an edge. We consider the problem of finding a complete partition maximizing the number of classes. This relates to clustering into the greatest number of groups so as to minimize the diameter (inter-cluster connectivity) without concern for the intra-cluster topology. We give a randomized...
متن کاملAn optimal algorithm for computing Frieze–Kannan regular partitions
In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze–Kannan-regular. With a more refined version of these two local conditions we provide a deterministic algorithm that obtains a Frieze–Kanan-regular partition of any graph G in time O(|V (G)|).
متن کاملAn Algorithm for Reconnecting Wireless Sensor Network Partitions
In a Wireless Sensor Network, sensor nodes may fail for several reasons and the network may split into two or more disconnected partitions. This may deteriorate or even nullify the usefulness and effectiveness of the network. Therefore, repairing partitions is a priority. In this paper we present a method to repair network partitions by using mobile nodes. By reasoning upon the degree of connec...
متن کاملShuffling algorithm for boxed plane partitions
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)× (b + 1)× c or (a + 1)× (b − 1)× c. Algorithmic realization of each step involves O((a+ b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.2307/2040114